Stability of graph pairs
نویسندگان
چکیده
We start up the study of stability general graph pairs. This notion is a generalization concept graphs. say that pair graphs $(\Gamma,\Sigma)$ stable if $Aut(\Gamma\times\Sigma) \cong Aut(\Gamma)\times Aut(\Sigma)$ and unstable otherwise, where $\Gamma\times\Sigma$ direct product $\Gamma$ $\Sigma$. An said to be nontrivially $\Sigma$ are connected coprime graphs, at least one them non-bipartite, each has property different vertices have distinct neighbourhoods. obtain necessary conditions for stable. also give characterization $(\Gamma, \Sigma)$ in case when both regular with valencies vertex-transitive. given terms $\Sigma$-automorphisms $\Gamma$, which new introduced this paper as automorphisms two-fold graph.
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولCritical Pairs in Term Graph Rewriting
Term graphs represent functional expressions such that common subexpressions can be shared, making expression evaluation more efficient than with strings or trees. Rewriting of term graphs proceeds by both applications of term rewrite rules and folding steps which enhance the degree of sharing. The present paper introduces critical pairs in term graph rewriting and establishes a Critical Pair L...
متن کاملStability Theorems for Symplectic and Contact Pairs
We prove Gray–Moser stability theorems for complementary pairs of forms of constant class defining symplectic pairs, contact-symplectic pairs and contact pairs. We also consider the case of contact-symplectic and contact-contact structures, in which the constant class condition on a oneform is replaced by the condition that its kernel hyperplane distribution have constant class in the sense of ...
متن کاملOn invertible generating pairs of fundamental groups of graph manifolds
We study invertible generating pairs of fundamental groups of graph manifolds, that is, pairs of elements (g, h) for which the map g → g −1 , h → h −1 extends to an automorphism. We show in particular that a graph manifold is of Heegaard genus 2 if and only if its fundamental group has an invertible generating pair.
متن کاملTracking based on graph of pairs of plots
Within the framework of a joint technical research cooperation project between Brazil and France, this paper proposes a new type of situation awareness algorithm based on the theory of graphs of pairs of plots (cf. Radar conference IEEE Washington 2010: “Tracking based on graph theory applied to pairs of plots”) using Brazilian Navy Aircraft Carrier "São Paulo" as a sensor data platform for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2020.10.002